Minus k-subdomination in graphs III
نویسندگان
چکیده
Let G = (V, E) be a graph. For any real valued function 1 : V --+ R and S ~ V, let 1 (S) = L:UES 1 ( u). The weight of 1 is defined as I(V). We will also denote I(N[v]) by I[v]' where v E V. A minus k-subdominating function (k8F) for G is defined in [1] as a function 1 : V --+ {-I, 0, I} such that I[v] 2:: 1 for at least k vertices of G. The minus k-subdomination number of a graph G, denoted by 'Yks101 (G), is equal to min{I(V) I f is a minus k8F of G}. Hattingh and Ungerer show in [5] that if T is a tree of order n 2:: 2 and k is an integer such that 1 :::; k ::; n 1, then 'Yk/01(T) 2:: k n + 2; In this paper, we characterise trees which achieve the lower bound, and show that the decision problem corresponding to the computation of this parameter is NP-complete.
منابع مشابه
Minus edge k-subdomination numbers in graphs
The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 0, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a minus edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all minus edge k-subdomin...
متن کاملA note on signed and minus domination in graphs
In this paper, we give upper bounds on the upper signed domination number of [l, k] graphs, which generalize some results obtained in other papers. Further, good lower bounds are established for the minus ksubdomination number γ−101 ks and signed k-subdomination number γ −11 ks .
متن کاملThe minus k-domination numbers in graphs
For any integer , a minus k-dominating function is afunction f : V (G) {-1,0, 1} satisfying w) for every vertex v, where N(v) ={u V(G) | uv E(G)} and N[v] =N(v)cup {v}. The minimum of the values of v), taken over all minusk-dominating functions f, is called the minus k-dominationnumber and is denoted by $gamma_k^-(G)$ . In this paper, we introduce the study of minu...
متن کاملSigned edge k-subdomination numbers in graphs
The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signed edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all signed edge k-subdomina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 17 شماره
صفحات -
تاریخ انتشار 1998